Maintaining trajectory privacy in mobile wireless sensor networks

Mobile wireless sensor networks (MWSN) is a subdomain of wireless sensor networks in which sensors and/or sinks are mobile. In this study, we propose a scheme for providing trajectory privacy of mobile sink nodes. The proposed scheme is based on random distribution of data packets. Moreover, sensor nodes do not use location information of the mobile sink or its trajectory. We performed simulation based and analytical performance evaluations for the proposed scheme. The results show that a network with up to 99% data delivery rate can be obtained by appropriate configuration while maintaining a fair level of trajectory privacy of the mobile sink node

Maintaining trajectory privacy in mobile wireless sensor networks

Sensors are tiny, resource-limited devices that are deployed in different areas to gather information for specific purposes. Wireless sensor networks consist of sensors with limited communication range and one or more sink nodes that are responsible for collecting the produced data by the sensors. Mobile wireless sensor networks is a subdomain of wireless sensor networks in which sensors and/or sinks are mobile. Trajectory privacy of the sink node is one of the security issues that are emerged with mobile wireless sensor networks. In this thesis, we propose a scheme for the trajectory privacy of mobile sink nodes. The proposed scheme is based on random distribution of data packets. In this scheme, sensor nodes do not use and need location information of the mobile sink or its trajectory. We performed simulation based and analytical performance evaluations for the proposed scheme. The results show that a network with up to 99% data delivery rate can be obtained by appropriate configuration of the scheme parameters while maintaining the trajectory privacy of the mobile sink node. In addition to that, the proposed scheme has economical resource usage since it does not involve any kind of cryptographic mechanism

Highly Efficient and Re-executable Private Function Evaluation with Linear Complexity

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Private function evaluation aims to securely compute a function f(x1, ... ; xn) without leaking any information other than what is revealed by the output, where f is a private input of one of the parties (say Party1) and xi is a private input of the i-th party Partyi. In this work, we propose a novel and secure two-party private function evaluation (2PFE) scheme based on the DDH assumption. Our scheme introduces a reusability feature that signi cantly improves the state-of-the-art. Accordingly, our scheme has two variants, one is utilized in the initial execution of the function f, and the other is utilized in its subsequent evaluations. To the best of our knowledge, this is the first and most efficient 2PFE scheme that enjoys a reusablity feature. Our protocols achieve linear communication and computation complexities and a constant number of rounds which is at most three

Highly efficient and re-executable private function evaluation with linear complexity

Private function evaluation aims to securely compute a function f(x_1, x_n)f(x1,...,xn) without leaking any information other than what is revealed by the output, where ff is a private input of one of the parties (say Party_1Party1) and x_ixi is a private input of the iith party Party_iPartyi. In this article, we propose a novel and secure two-party private function evaluation (2PFE) scheme based on the DDH assumption. Our scheme introduces a reusability feature that significantly improves the state-of-the-art. Accordingly, our scheme has two variants, one is utilized in the initial execution of the function ff, and the other is utilized in its subsequent evaluations. To the best of our knowledge, this is the first and most efficient 2PFE scheme that enjoys a reusablity feature. Our protocols achieve linear communication and computation complexities and a constant number of rounds which is at most three

Towards Practical PFE: An Efficient 2-Party Private Function Evaluation Protocol Based on Half Gates

Private function evaluation (PFE) is a special case of secure multi-party computation (MPC), where the function to be computed is known by only one party. PFE is useful in several real-life settings where an algorithm or a function itself needs to remain secret due to its confidential classification or intellectual property. In this work, we look back at the seminal PFE framework presented by Mohassel and Sadeghian at Eurocrypt’13. We show how to adapt and utilize the well-known half gates garbling technique (Zahur et al., Eurocrypt’15) to their constant round 2-party PFE scheme. Compared to their scheme, our resulting optimization considerably improves the efficiency of both the underlying Oblivious Evaluation of Extended Permutation (OEP) and secure 2-party computation (2PC) protocol, and yields a more than 40% reduction in overall communication cost (the computation time is also slightly decreased, and the number of rounds remains unchanged)

An efficient 2-party private function evaluation protocol based on half gates

Private function evaluation (PFE) is a special case of secure multi-party computation (MPC), where the function to be computed is known by only one party. PFE is useful in several real-life applications where an algorithm or a function itself needs to remain secret for reasons such as protecting intellectual property or security classification level. In this paper, we focus on improving 2-party PFE based on symmetric cryptographic primitives. In this respect, we look back at the seminal PFE framework presented by Mohassel and Sadeghian at Eurocrypt’13. We show how to adapt and utilize the well-known half gates garbling technique (Zahur et al., Eurocrypt’15) to their constant-round 2-party PFE scheme. Compared to their scheme, our resulting optimization significantly improves the efficiency of both the underlying Oblivious Evaluation of Extended Permutation (OEP) and secure 2-party computation (2PC) protocols, and yields a more than 40% reduction in overall communication cost (the computation time is also slightly decreased and the number of rounds remains unchanged)

Comparison of ON-Q elastomeric pump system and thoracic epidural analgesia methods for pain management after thoracotomy

Background: This study aims to compare the results of continuous infusion of local anesthetics through either ON-Q elastomeric pump or thoracic epidural analgesia for management of pain after thoracotomy

Mean Platelet Volume Decreases in Adult Patients With Obstructive Sleep Apnea After Uvulopalatal Flap Surgery

SIMSEK, GOKCE/0000-0001-5281-0986WOS: 000367905900025PubMed: 26468800Aim:The main purpose of the study was to investigate changes in mean platelet volume (MPV) values in patients with obstructive sleep apnea syndrome (OSAS) who had undergone uvulopalatal flap (UPF) surgery.Method:The study included a review of the medical records of 37 adult patients who had undergone UPF surgery after being diagnosed with OSAS. The baseline blood parameters of patients, including the MPV and platelet distribution width (PDW) values, were measured and repeated 3 months after treatment. Polysomnographic evaluations of the patients were also performed during admission and the 3rd month control. Comparisons of MPV values and their correlation with polysomnographic parameters were the main outcomes measured.Results:The blood parameters of all patients were similar except for MPV values, which were significantly lower after treatment (P0.05).Conclusion:The UPF surgery, which is a relatively simple surgical intervention to treat OSAS, alleviates nocturnal hypoxic episodes and lowers platelet volume. These may both be important predictors of adverse cardiovascular outcomes related to OSAS